Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations

نویسندگان

چکیده

This paper mainly studies the gradient-based Jacobi-type algorithms to maximize two classes of homogeneous polynomials with orthogonality constraints, and establish their convergence properties. For first class subject a constraint on Stiefel manifold, we reformulate it as an optimization problem unitary group, which makes possible apply (Jacobi-G) algorithm. Then, if subproblem can always be represented quadratic form, global Jacobi-G under any one three conditions. The result for condition is easy extension by Usevich, Li, Comon [SIAM J. Optim. 30 (2020), pp. 2998–3028], while other conditions are new ones. algorithm properties well-known joint approximate symmetric tensor diagonalization. second constraints product manifolds, groups, then develop multiblock (Jacobi-MG) solve it. We Jacobi-MG above conditions, form. suitable As proximal variants Jacobi-MG, also propose Jacobi-GP Jacobi-MGP algorithms, without further condition. Some numerical results provided indicating efficiency proposed algorithms.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Homogeneous Einstein metrics on Stiefel manifolds

A Stiefel manifold VkR n is the set of orthonormal k-frames inR, and it is diffeomorphic to the homogeneous space SO(n)/SO(n−k). We study SO(n)-invariant Einstein metrics on this space. We determine when the standard metric on SO(n)/SO(n−k) is Einstein, and we give an explicit solution to the Einstein equation for the space V2R.

متن کامل

Well-posedness of convex maximization problems on Stiefel manifolds and orthogonal tensor product approximations

Problems of best tensor product approximation of low orthogonal rank can be formulated as maximization problems on Stiefel manifolds. The functionals that appear are convex and weakly sequentially continuous. It is shown that such problems are always well-posed, even in the case of non-compact Stiefel manifolds. As a consequence, problems of finding a best orthogonal, strong orthogonal or compl...

متن کامل

Some Global Optimization Problems on Stiefel Manifolds

Optimization on Stiefel manifolds was discussed by Rapcsák in earlier papers, and some global optimization methods were considered and tested on Stiefel manifolds. In the paper, test functions are given with known global optimum points and their optimal function values. A restriction, which leads to a discretization of the problem is suggested, which results in a problem equivalent to the well-...

متن کامل

Approximation algorithms for homogeneous polynomial optimization with quadratic constraints

In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such optimization models have wide applications, e.g., in signal processing, magnetic resonance imaging (MRI), data training, approximation theory, and portfolio selection. Since polynomial functions are nonconvex in general, t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 2023

ISSN: ['1088-6842', '0025-5718']

DOI: https://doi.org/10.1090/mcom/3834